Distillation protocols: output entanglement and local mutual information.
نویسندگان
چکیده
A complementary behavior between local mutual information and average output entanglement is derived for arbitrary bipartite ensembles. This leads to bounds on the yield of entanglement in distillation protocols that involve disinguishing. This bound is saturated in the hashing protocol for distillation, for Bell-diagonal states.
منابع مشابه
How to Exploit Local Information When Distilling Entanglement
Distillation protocols enable generation of high quality entanglement even in the presence of noise. Existing protocols ignore the presence of local information in mixed states produced from some noise sources such as photon loss, amplitude damping or thermalization. We propose new protocols that exploit local information in mixed states. Our protocols converge to higher fidelities in fewer rou...
متن کاملEntanglement of Distillation and Conditional Mutual Information
In previous papers, we expressed the Entanglement of Formation in terms of Conditional Mutual Information (CMI). In this brief paper, we express the Entanglement of Distillation in terms of CMI.
متن کاملThe equivalence of two approaches to the design of entanglement distillation protocols
We show the equivalence of two approaches to the design of entanglement distillation protocols. The first approach is based on local unitary operations that yield permutations of tensor products of Bell states. The second approach is based on stabilizer codes.
متن کاملTowards the Communication Complexity of Entanglement Distillation Protocols
Quantum entanglement distillation protocols are LOCC protocols that, over “imperfect” EPR pairs shared between Alice and Bob as input, output perfect or near-perfect EPR pairs. In this paper, we study the communication complexity of these protocols, that is, the minimal number of (classical) bits needed for Alice and Bob. We consider 3 models for imperfect EPR pairs. In the measure-r model, r o...
متن کاملComputing quantum discord is NP-complete
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review letters
دوره 93 17 شماره
صفحات -
تاریخ انتشار 2004